-
1 combinatorial problem
Большой англо-русский и русско-английский словарь > combinatorial problem
-
2 combinatorial problem
Математика: комбинаторная задача -
3 combinatorial problem
Англо-русский словарь по компьютерной безопасности > combinatorial problem
-
4 combinatorial problem
см. тж. combinatoricsАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > combinatorial problem
-
5 combinatorial problem
мат.English-Russian scientific dictionary > combinatorial problem
-
6 problem
1) задача; проблема3) трудность, затруднение•- boundary value problem - card matching problem - central limit problem - decision problem under risk - decision problem under uncertainty - extremum problem - fair division problem - gambling problem - gasoline blending problem - incompletely structured problem - optimal path problem - optimal stopping problem - portfolio selection problem - precisely specified problem - recursively solvable problem - sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem - standard control problem - three houses and three wells problem -
7 problem
задача; проблемаАнгло-русский словарь по компьютерной безопасности > problem
-
8 combinatorial optimization problem with numerical input
Универсальный англо-русский словарь > combinatorial optimization problem with numerical input
-
9 combinatorial optimization problem with numerical input
Engineering: COPNIУниверсальный русско-английский словарь > combinatorial optimization problem with numerical input
-
10 combinatorial optimization problem
Англо-русский словарь промышленной и научной лексики > combinatorial optimization problem
-
11 traveling salesman problem
= TSPклассическая задача из теории графов: коммивояжеру требуется объехать несколько городов, побывав в каждом ровно один раз, и вернуться в исходную точку. Нужно найти кратчайший маршрут. Задача характеризуется нелинейным ростом числа вариантов и не имеет эффективных алгоритмов решениясм. тж. combinatorial explosionАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > traveling salesman problem
-
12 комбинаторная задача
Русско-английский научно-технический словарь Масловского > комбинаторная задача
-
13 комбинаторная задача
Mathematics: combinatorial problemУниверсальный русско-английский словарь > комбинаторная задача
-
14 COPNI
combinatorial optimization problem with numerical input - комбинаторная задача оптимизации с цифровыми входными данными -
15 Heuristics
[A]t one point AM [Automatic Mathematician] had some notions of sets, set-operations, numbers, and simple arithmetic. One heuristic rule it knew said " If F is an interesting relation, then look at its inverse". This rule fired after AM had studied "multiplication" for a while. The r.h.s. of the rule then directed AM to define and study the relation "divisors-of" (e.g. divisors-of (12) {1,2,3,4,6,12}. Another heuristic rule that later fired said " If f is a relation from A into B, then it's worth examining those members of A which map into extremal members of B." In this case, f was matched to "divisors-of", A was "numbers", B was "sets of numbers", and an extremal member of B might be, e.g., a very small set of numbers. Thus this heuristic rule caused AM to define the set of numbers with no divisors, the set of numbers with only 1 divisor, with only 2 divisors, etc. One of these sets (the last [ sic] mentioned) turned out subsequently to be quite important; these numbers are of course the primes. (Lenat & Harris, 1978, p. 30)Extraordinarily rapid progress during the early stages of an attack on a new problem area is a rather common occurrence in AI research; it merely signifies that the test cases with which the system has been challenged are below the level of difficulty where combinatorial explosion of the number of pathways in the problem space sets in.... It is the goal of AI research to move that threshold higher and higher on the scale of problem complexity through the introduction of heuristics-heuristics to reduce the rate of growth of the solution tree, heuristics to guide the development of the tree so that it will be rich in pathways leading to satisfactory problem solutions, and heuristics to direct the search to the "best" of these pathways. (Gelernter, quoted in Barr & Feigenbaum, 1982, pp. 139-140)Historical dictionary of quotations in cognitive science > Heuristics
-
16 algorithm
-
ad hoc algorithm
-
adaptive algorithm
-
aim algorithm
-
best-route algorithm
-
branch-and-bound algorithm
-
branching algorithm
-
chain algorithm
-
coding algorithm
-
collision fronts algorithm
-
combinatorial algorithm
-
computational algorithm
-
construction algorithms
- contour following algorithm -
contour matching algorithm
-
control algorithm
-
curve-fitting algorithm
-
decoding algorithm
-
division algorithm
-
docking algorithm
-
edge-tracking algorithm
-
Euclidian algorithm
-
exact embedding algorithm
-
exchange algorithm
-
generalized algorithm
-
greedy algorithm
-
hardware algorithm
-
image understanding algorithm
-
itention algorithm
-
layout algorithm
-
learning algorithm
-
logical algorithm
-
logic algorithm
-
look-ahead control algorithm
-
LOS approach algorithm
-
min-cut algorithm
-
modeling algorithm
-
Monte-Carlo algorithm
-
numerical algorithm
-
obstacle-avoidance algorithm
-
operating algorithm
-
ordering algorithm
-
paging algorithm
-
partitioning algorithm
-
pattern generation algorithm
-
placement algorithm
-
prediction algorithm
-
probabalistic algorithm
-
problem algorithm
-
programming algorithm
-
random-search algorithm
-
recognition algorithm
-
recursive algorithm
-
rendezvous algorithm
-
routing algorithm
-
scheduling algorithm
-
shortest path algorithm
-
shrinking algorithm
-
simplex algorithm
-
software algorithm
-
sorting algorithm
-
stack algorithm
-
steering algorithm
-
stochastic algorithm
-
testing algorithm
-
transportation algorithm
-
tree-search algorithm
-
velocity compensated algorithm
-
vision algorithm
-
wiring algorithm -
17 COPNI
-
18 комбинаторная задача оптимизации с цифровыми входными данными
Универсальный русско-английский словарь > комбинаторная задача оптимизации с цифровыми входными данными
-
19 analysis
- analysis of observations
- analysis of optical spectrum - activation analysis
- a-posteriori analysis
- approximate analysis
- a-priori analysis
- automatic number analysis
- batch circuit analysis
- behavioral analysis
- binding-time analysis
- bottom-up analysis
- cepstral analysis
- cipher analysis
- circuit analysis
- cluster analysis
- combinatorial analysis
- comparative analysis
- compatibility analysis
- complex analysis
- content analysis
- contingency analysis
- conversational analysis
- cost analysis
- cost/benefit analysis
- covariance analysis
- critical path analysis
- crystal analysis
- cyclic analysis
- dataflow analysis
- decision-tree analysis
- dimensional analysis
- discourse analysis
- discriminant analysis
- display data analysis
- domain analysis
- EDX analysis
- electron diffraction analysis
- electron probe analysis
- empirical analysis
- energy-dispersive X-ray analysis
- error analysis
- factor analysis
- failure analysis - fluorescence analysis
- Fourier analysis
- fractal image analysis
- frequency analysis
- frequency-domain analysis
- frequency-response analysis
- functional analysis
- fuzzy analysis
- fuzzy logic analysis
- harmonic analysis
- incremental circuit analysis
- interactive signal analysis
- interferometric analysis
- interval analysis
- joint analysis
- Kaplan-Meier analysis
- kernel discriminant analysis
- k-means cluster analysis
- large-signal analysis
- laser microprobe analysis
- linear two-group discriminant analysis
- linguistic analysis
- logic analysis
- logistic analysis
- logit analysis
- log-linear analysis
- luminescent analysis
- magnetic neutron diffraction analysis
- malfunction analysis
- mathematical analysis
- matrix analysis
- maximum-likelihood analysis
- means/ends analysis
- memory operating characteristic analysis
- mesh analysis
- meta-analysis
- microprobe analysis
- mixed-level analysis
- mixed-mode analysis
- modified nodal analysis
- Monte-Carlo analysis
- morphological analysis
- multifactor analysis of variance
- multilevel analysis
- multimode analysis
- multiple discriminant analysis
- multivariate analysis
- network analysis
- nodal analysis
- numerical analysis - operation analysis
- path analysis
- phase-plane analysis
- photon analysis
- photothermoelectric analysis
- policy analysis - probabilistic analysis
- problem analysis
- protocol analysis
- qualitative analysis
- quantitative analysis
- radar signal analysis
- radiographic analysis
- radiometric analysis
- randomized block analysis of variance
- receiver operating characteristic analysis
- regression analysis
- regression correlation analysis
- repeated measures analysis of variance
- requirements analysis
- risk analysis
- sampling analysis
- set analysis
- signature analysis
- single-mode analysis
- small-signal analysis
- sound analysis
- sparse table analysis
- spectral analysis
- spectrophotometric analysis
- spectrum signature analysis
- speech analysis
- static analysis
- statistical analysis
- sticky analysis
- structural analysis
- structured analysis
- structured systems analysis
- survival analysis
- syntactic analysis
- syntactical analysis
- system analysis
- system analysis in control
- tensor analysis
- time-domain analysis
- time-to-event analysis
- top-down analysis
- topological analysis
- traffic analysis
- trend analysis
- two-factor factorial analysis of variance
- wave-length dispersive X-ray analysis
- weighted analysis
- what if analysis
- worst-case analysis
- X-ray analysis
- X-ray spectral analysis
- X-ray structure analysis -
20 analysis
- a posteriori analysis
- a priori analysis
- activation analysis
- analysis of covariance
- analysis of means
- analysis of observations
- analysis of optical spectrum
- analysis of variance
- approximate analysis
- automatic number analysis
- batch circuit analysis
- behavioral analysis
- binding-time analysis
- bottom-up analysis
- cepstral analysis
- cipher analysis
- circuit analysis
- cluster analysis
- combinatorial analysis
- comparative analysis
- compatibility analysis
- complex analysis
- content analysis
- contingency analysis
- conversational analysis
- cost analysis
- cost/benefit analysis
- covariance analysis
- critical path analysis
- crystal analysis
- cyclic analysis
- dataflow analysis
- decision-tree analysis
- dimensional analysis
- discourse analysis
- discriminant analysis
- display data analysis
- domain analysis
- EDX analysis
- electron diffraction analysis
- electron probe analysis
- empirical analysis
- energy-dispersive X-ray analysis
- error analysis
- factor analysis
- failure analysis
- failure mode and effects analysis
- fault-tree analysis
- feature analysis
- finite element analysis
- flow analysis
- fluorescence analysis
- Fourier analysis
- fractal image analysis
- frequency analysis
- frequency-domain analysis
- frequency-response analysis
- functional analysis
- fuzzy analysis
- fuzzy logic analysis
- harmonic analysis
- incremental circuit analysis
- interactive signal analysis
- interferometric analysis
- interval analysis
- joint analysis
- Kaplan-Meier analysis
- kernel discriminant analysis
- k-means cluster analysis
- large-signal analysis
- laser microprobe analysis
- linear two-group discriminant analysis
- linguistic analysis
- logic analysis
- logistic analysis
- logit analysis
- log-linear analysis
- luminescent analysis
- magnetic neutron diffraction analysis
- malfunction analysis
- mathematical analysis
- matrix analysis
- maximum-likelihood analysis
- means/ends analysis
- memory operating characteristic analysis
- mesh analysis
- meta-analysis
- microprobe analysis
- mixed-level analysis
- mixed-mode analysis
- modified nodal analysis
- Monte-Carlo analysis
- morphological analysis
- multifactor analysis of variance
- multilevel analysis
- multimode analysis
- multiple discriminant analysis
- multivariate analysis
- network analysis
- nodal analysis
- numerical analysis
- object-oriented analysis
- off-line circuit analysis
- operation analysis
- path analysis
- phase-plane analysis
- photon analysis
- photothermoelectric analysis
- policy analysis
- predictable failure analysis
- principal components analysis
- probabilistic analysis
- problem analysis
- protocol analysis
- qualitative analysis
- quantitative analysis
- radar signal analysis
- radiographic analysis
- radiometric analysis
- randomized block analysis of variance
- receiver operating characteristic analysis
- regression analysis
- regression correlation analysis
- repeated measures analysis of variance
- requirements analysis
- risk analysis
- sampling analysis
- set analysis
- signature analysis
- single-mode analysis
- small-signal analysis
- sound analysis
- sparse table analysis
- spectral analysis
- spectrophotometric analysis
- spectrum signature analysis
- speech analysis
- static analysis
- statistical analysis
- sticky analysis
- structural analysis
- structured analysis
- structured systems analysis
- survival analysis
- syntactic analysis
- syntactical analysis
- system analysis in control
- system analysis
- tensor analysis
- time-domain analysis
- time-to-event analysis
- top-down analysis
- topological analysis
- traffic analysis
- trend analysis
- two-factor factorial analysis of variance
- wave-length dispersive X-ray analysis
- weighted analysis
- what if analysis
- worst-case analysis
- X-ray analysis
- X-ray spectral analysis
- X-ray structure analysisThe New English-Russian Dictionary of Radio-electronics > analysis
- 1
- 2
См. также в других словарях:
Combinatorial design — theory is the part of combinatorial mathematics that deals with the existence and construction of systems of finite sets whose intersections have specified numerical properties. For instance, a balanced incomplete block design (usually called for … Wikipedia
Combinatorial commutative algebra — is a relatively new, rapidly developing mathematical discipline. As the name implies, it lies at the intersection of two more established fields, commutative algebra and combinatorics, and frequently uses methods of one to address problems… … Wikipedia
Combinatorial meta-analysis — (CMA) is the study of the behaviour of statistical properties of combinations of studies from a meta analytic dataset (typically in social science research). In an article that develops the notion of gravity in the context of meta analysis, Dr.… … Wikipedia
Combinatorial optimization — In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.[1] In many such problems, exhaustive search is not feasible. It operates on… … Wikipedia
Combinatorial auction — A combinatorial auction is a type of smart market in which participants can place bids on combinations of discrete items, or “packages,” rather than just individual items or continuous quantities. Simple combinatorial auctions have been used for… … Wikipedia
Combinatorial group theory — In mathematics, combinatorial group theory is the theory of free groups, and the concept of a presentation of a group by generators and relations. It is much used in geometric topology, the fundamental group of a simplicial complex having in a… … Wikipedia
Combinatorial map — A combinatorial map is a combinatorial object modelling topological structures with subdivided objects. Historically, the concept was introduced informally by J. Edmonds for polyhedral surfaces [1] which are planar graphs. It was given its first… … Wikipedia
Combinatorial proof — In mathematics, the term combinatorial proof is often used to mean either of two types of proof of an identity in enumerative combinatorics that either states that two sets of combinatorial configurations, depending on one or more parameters,… … Wikipedia
Problem des Handlungsreisenden — Optimaler Reiseweg eines Handlungsreisenden durch die 15 größten Städte Deutschlands. Die angegebene Route ist die kürzeste von 43.589.145.600 möglichen. Das Problem des Handlungsreisenden (auch Rundreiseproblem, engl. Traveling Salesman Problem… … Deutsch Wikipedia
Problem des Handelsreisenden — Optimaler Reiseweg eines Handlungsreisenden durch die 15 größten Städte Deutschlands. Die angegebene Route ist die kürzeste von 43.589.145.600 möglichen. Das Problem des Handlungsreisenden (engl. Traveling Salesman Problem, kurz TSP) ist ein … Deutsch Wikipedia
Problem der Museumswächter — Das Problem der Museumswächter (en: Art gallery problem) ist eine Fragestellung der Algorithmischen Geometrie. Dabei wird folgende Situation untersucht: „Gegeben sei eine polygonale Fläche G mit Rand , interpretiert als Grundriss eines Museums.… … Deutsch Wikipedia